The linear complexity of new binary cyclotomic sequences of period pn
نویسنده
چکیده
In this paper, we determine the linear complexity of a class of new binary cyclotomic sequences of period pn constructed by Z. Xiao et al. (Des. Codes Cryptogr. DOI 10.1007/s10623-017-0408-7) and prove their conjecture about high linear complexity of these sequences.
منابع مشابه
Autocorrelation of New Generalized Cyclotomic Sequences of Period pn
Let n ≥ 2 be a positive integer and Z× n be the multiplicative group of the integer ring Zn. For a partition {Di|i = 0, 1, · · · , d − 1} of Z× n , if there exist elements g1, · · · , gd of Z× n satisfying Di = giD0 for all i where D0 is a multiplicative subgroup of Z× n , the Di are called generalized cyclotomic classes of order d. There have been lots of studies about cyclotomy with respect t...
متن کاملOn error linear complexity of new generalized cyclotomic binary sequences of period p2
We consider the k-error linear complexity of a new binary sequence of period p2, proposed in the recent paper “New generalized cyclotomic binary sequences of period p2”, by Z. Xiao et al., who calculated the linear complexity of the sequences (Designs, Codes and Cryptography, 2017, https://doi.org/10.1007/s10623017-0408-7). More exactly, we determine the values of k-error linear complexity over...
متن کاملLower bound on the 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period $p^n$
Let p be an odd prime, n a positive integer and g a primitive root of pn. Suppose D (p) i = {g 2s + i|s = 0, 1, 2, · · · , (p−1)p n−1 2 }, i = 0, 1 is the generalized cyclotomic classes with Z∗ pn = D0 ∪D1. In this paper, we prove that Gauss periods based on D0 and D1 are both equal to 0 for n ≥ 2. As an application, we determine a lower bound on the 2-adic complexity of generalized cyclotomic ...
متن کاملTrace Representations and Multi-rate Constructions of Two Classes of Generalized Cyclotomic Sequences
In this paper, two classes of generalized cyclotomic sequences of period pq are reconstructed by means of multi-rate parallel combinations of binary Legendre sequences which are clocked at different rates. Then these generalized cyclotomic sequences can be generated by combinations of short and cheap LFSR’s. From the multi-rate constructions and the trace representation of binary Legendre seque...
متن کاملAbout the Linear Complexity of Ding-Hellesth Generalized Cyclotomic Binary Sequences of Any Period
We defined sufficient conditions for designing Ding-Helleseth sequences with arbitrary period and high linear complexity for generalized cyclotomies. Also we discuss the method of computing the linear complexity of Ding-Helleseth sequences in the general case.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1712.03947 شماره
صفحات -
تاریخ انتشار 2017